New advances in permutation decoding of first-order Reed-Muller codes
نویسندگان
چکیده
In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect certain type information sets. particular, apply it family first-order Reed-Muller codes sets introduced in [2]. Using improve considerably number errors correct comparison known results topic.
منابع مشابه
Partial permutation decoding for the first-order Reed-Muller codes
Partial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), where m > 4 by finding s-PD-sets for these codes for 2 ≤ s ≤ 4. © 2008 Elsevier B.V. All rights reserved.
متن کاملRecursive decoding of Reed-Muller codes
New softand hard decision decoding algorithms are presented for general Reed-Muller codes m r of length 2m and distance 2m r. We use Plotkin (u; u + v) construction and decompose code m r onto subblocks u 2 m 1 r and v 2 n m 1 r 1 o : In decoding, we rst try to nd a subblock v from the better protected code and then proceed with the block u. The likelihoods of the received symbols are recalcu...
متن کاملList Decoding of Reed-Muller Codes
We construct list decoding algorithms for first order Reed-Muller codes RM [1,m] of length n = 2m correcting up to n(12 − 2) errors with complexity O(n2−3). Considering probabilistic approximation of these algorithms leads to randomized list decoding algorithms with characteristics similar to Goldreich-Levin algorithm, namely, of complexity O(m22−7 log 12 (log 12 +log 1 Perr +log m)), where Per...
متن کاملDecoding Reed-Muller Codes Over Product Sets
We give a polynomial time algorithm to decode multivariate polynomial codes of degree d up to half their minimum distance, when the evaluation points are an arbitrary product set S, for every d < |S|. Previously known algorithms could achieve this only if the set S had some very special algebraic structure, or if the degree d was significantly smaller than |S|. We also give a near-linear time r...
متن کاملRecursive List Decoding for Reed-Muller Codes
We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and show that they substantially outperform other decoding algorithms with nonexponential complexity known for RM codes. Decoding performance is further enhanced by using intermediate code lists and permutation procedures....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2023
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2023.102182